Mr. Worley
2025 Sep 29
Angle = 30°
Start = A
Rules:
A > A[+A][-A]B
B > [--B]A
Number of recursions = 7
Angle = 60°
Start = A
Rules:
A > -B+B+B+B+B+B
B > B[--CCA][-CCA]B
C > CC
Number of recursions = 7
Angle = 45°
Start = A
Rules:
A > [----AAB][--AAB][++AAB]AAB
B > [-C][+C][--C][++C][---C][+++C]
C > CAB
Number of recursions = 6
Angle = 72°
Start = A
Rules:
A > [-AAB][--AAB][+AAB][++AAB]AAB
B > [-C][+C][--C][++C]CA
C > CC
Number of recursions = 5
Angle = 60°
Start = a
Rules:
a > -B+B+B+B+B+B
B > BB[-CCa]
C > CC
Number of recursions = 9
Angle = 72°
Start = A
Rules:
A > B+B+B+B+B
B > [-CCA]BB
C > CC
Number of recursions = 9
Angle = 45°
Start = A
Rules:
A > +A-B-B[B]
B > -B+A+A[A]
Number of recursions = 8
Angle = 90°
Start = A
Rules:
A > AA[-A][+A]
Number of recursions = 8
Angle = 30°
Start = A
Rules:
A > AcbcA
b > [+A][-A][++A][--A][+++A][---A][++++A][----A][+++++A][-----A]
c > bAb
Number of recursions = 6
Angle = 30°
Start = AB
Rules:
A > B--B
B > AA+++AA
Number of recursions = 12
Angle = 30°
Start = x
Rules:
x > FFF[+FFF+FFF+FF+FF+F+Fx][-FFF-FFF-FF-FF-F-Fx]Fx
F > FFx
Number of recursions = 6
Angle = 45°
Start = A
Rules:
A > AB
B > A[++C][--C]
C > C[+C][-C]A
Number of recursions = 10
Angle = 25°
Start = -x
Rules:
x > F+[[x]-x]-F[-Fx]+x
F > FF
Number of recursions = 7
Angle = 90°
Start = b
Rules:
A > AA
b > AbA+AbA+AbA
Number of recursions = 9
Angle = 115°
Start = A
Rules:
A > A+A-A
Number of recursions = 11
Angle = 90°
Start = A
Rules:
A > A[+AA][-AA]B
B > ABA
Number of recursions = 7
Angle = 6°
Start = x
Rules:
x > FFF[+FF+FF+FF+F+Fx][-FF-FF-FF-F-Fx]FFFFFFFFFFFFFFx
F > FF
Number of recursions = 8
Example:
First few recursions:
Start:
ARules:
A \(\to\)
ART-R \(\to\)
RAT-T \(\to\)
TAR-- \(\to\)
-Notice, “-” is constant. We usually don’t include constants in the rules. If a character does not have a replacement rule, we assume it is a constant.
Find the recursions (the iterations):
AART-ART-RAT-TAR-ART-RAT-TAR--RAT-ART-TAR--TAR-ART-RAT--ART-RAT-TAR--RAT-ART-TAR--TAR-ART-RAT---RAT-ART-TAR--ART-RAT-TAR--TAR-ART-RAT---TAR-ART-RAT--ART-RAT-TAR--RAT-ART-TAR---Start:
Rules:
Find the recursions (the iterations):
Draw the following string:
\[\mathtt{FFF[+FFF+FFF+FF+FF+F+F][-FFF-FFF-FF-FF-F-F]F}\]
Over a few days we will code the following programs in Scratch: